Application of Biased Metropolis Algorithms: From protons to proteins
نویسندگان
چکیده
We show that sampling with a biased Metropolis scheme is essentially equivalent to using the heatbath algorithm. However, the biased Metropolis method can also be applied when an efficient heatbath algorithm does not exist. This is first illustrated with an example from high energy physics (lattice gauge theory simulations). We then illustrate the Rugged Metropolis method, which is based on a similar biased updating scheme, but aims at very different applications. The goal of such applications is to locate the most likely configurations in a rugged free energy landscape, which is most relevant for simulations of biomolecules.
منابع مشابه
Biased Metropolis-Heatbath Algorithms for Lattice Gauge Theory
It is illustrated for 4D SU(2) lattice gauge theory that sampling with a biased Metropolis scheme is essentially equivalent to using the heatbath algorithm. Only, the biased Metropolis method can also be applied when an efficient heatbath algorithm does not exist. Other cases for which the use of the biased Metropolis-heatbath algorithm is beneficial are briefly summarized.
متن کاملHeat Bath Efficiency with Metropolis-type Updating
We illustrate for 4D SU(2) and U(1) lattice gauge theory that sampling with a biased Metropolis scheme is essentially equivalent to using the heat bath algorithm. Only, the biased Metropolis method can also be applied when an efficient heat bath algorithm does not exist. For the examples discussed the biased Metropolis algorithm is also better suited for parallelization than the heat bath algor...
متن کاملBiased Metropolis Sampling for Rugged Free Energy Landscapes
Metropolis simulations of all-atom models of peptides (i.e. small proteins) are considered. Inspired by the funnel picture of Bryngelson and Wolyness, a transformation of the updating probabilities of the dihedral angles is defined, which uses probability densities from a higher temperature to improve the algorithmic performance at a lower temperature. The method is suitable for canonical as we...
متن کاملBiased Metropolis-heat-bath Algorithm for Fundamental-adjoint Su(2) Lattice Gauge Theory
For SU(2) lattice gauge theory with the fundamental-adjoint action an efficient heat-bath algorithm is not known so that one had to rely on Metropolis simulations supplemented by overrelaxation. Implementing a novel biased Metropolis-heat-bath algorithm for this model, we find improvement factors in the range 1.45 to 2.06 over conventionally optimized Metropolis simulations. If one optimizes fu...
متن کاملOn the ergodicity properties of someadaptive MCMC algorithms
In this paper we study the ergodicity properties of some adaptive Markov chain Monte Carlo algorithms (MCMC) that have been recently proposed in the literature. We prove that under a set of verifiable conditions, ergodic averages calculated from the output of a so-called adaptive MCMC sampler converge to the required value and can even, under more stringent assumptions, satisfy a central limit ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Mathematics and computers in simulation
دوره 80 6 شماره
صفحات -
تاریخ انتشار 2010